A Constant-Factor Approximation Algorithm for TSP with Neighborhoods in the Plane
نویسنده
چکیده
In the Euclidean TSP with neighborhoods (TSPN) problem we seek a shortest tour that visits a given set of n neighborhoods. The Euclidean TSPN generalizes the standard TSP on points. We present the first constant-factor approximation algorithm for TSPN on an arbitrary set of disjoint, connected neighborhoods in the plane. Prior approximation bounds were O(log n), except in special cases. Our approximation algorithm applies to arbitrary connected neighborhoods of any size or shape, as long as they are disjoint (or moderately overlapping).
منابع مشابه
TSP with Neighborhoods of Varying Size
In TSP with neighborhoods (TSPN) we are given a collection S of objects in the plane, called neighborhoods, and we seek the shortest tour that visits all neighborhoods. Until now constant-factor approximation algorithms have been known only for cases where the objects are of approximately the same size. In this paper we present the rst polynomial time constant-factor approximation algorithm for...
متن کاملOn Approximating the TSP with Intersecting Neighborhoods
In the TSP with neighborhoods problem we are given a set of n regions (neighborhoods) in the plane, and seek to find a minimum length TSP tour that goes through all the regions. We give two approximation algorithms for the case when the regions are allowed to intersect: We give the first O(1)-factor approximation algorithm for intersecting convex fat objects of comparable diameters where we are...
متن کاملConstant-Factor Approximation for TSP with Disks
We revisit the traveling salesman problem with neighborhoods (TSPN) and present the first constant-ratio approximation for disks in the plane: Given a set of n disks in the plane, a TSP tour whose length is at most O(1) times the optimal can be computed in time that is polynomial in n. Our result is the first constant-ratio approximation for a class of planar convex bodies of arbitrary size and...
متن کاملApproximation Algorithms for Euclidean Group TSP
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P . We want to find a tour of minimum length that visits at least one point in each region. This unifies the TSP with Neighborhoods and the Group Steiner Tree problem. We give a (9.1α + 1)-approximation algorithm for the cas...
متن کاملApproximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and Continuous Neighborhoods
In the Euclidean traveling salesman problem with discrete neighborhoods, we are given a set of points P in the plane and a set of n connected regions (neighborhoods), each containing at least one point of P . We seek to find a tour of minimum length which visits at least one point in each region. We give (i) an O(α)-approximation algorithm for the case when the regions are disjoint and α-fat, w...
متن کامل